Average Least Nonresidues
نویسنده
چکیده
Steven Finch December 4, 2013 Fifty years separate two computations: the mean value of a certain function () over primes , mentioned in [1], and the mean value of () over all positive integers . We anticipate that the overlap between number theory and probability will only deepen with time. 0.1. Quadratic. Let () be the smallest positive quadratic nonresidue modulo 2. Erdős [2] proved that
منابع مشابه
Subset Sums Avoiding Quadratic Nonresidues
It is a well-known problem to give an estimate for the largest clique of the Paley-graph, i.e. , to give an estimate for |A| if A ⊂ Fp (p ≡ 1 (mod 4)) is such that A−A = {a−a′ |a, a′ ∈ A} avoids the set of quadratic nonresidues. In this paper we will study a much simpler problem namely when A− A is substituted by the set FS(A) = { ∑ εaa | εa = 0 or 1 and ∑ εa > 0}. In other words we will estima...
متن کاملGeneralizations of a Classical Theorem in Number Theory
A classical theorem conjectured by Jacobi asserts that for an odd prime p, the sum of the quadratic residues in the interval (0, p) is less than the sum of the quadratic nonresidues if and only if p ■ 3 (mod 4). We generalize Jacobi's problem to fcth powers (mod p), k > 2, and we consider in some detail a generalization of Jacobi's conjecture to quadratic residues and nonresidues (mod n), n an ...
متن کاملConstructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis February
We describe a new deterministic algorithm for the problem of constructing k th power nonresidues in nite elds GF p where p is prime and k is a prime divisor of p We prove under the assumption of the Extended Riemann Hypothesis ERH that for xed n and p our algorithm runs in polynomial time Unlike previous algorithms for this problem this polynomial time bound holds even if k is very large More g...
متن کاملConstructing Nonresidues in Finite Fields and
We describe a new deterministic algorithm for the problem of constructing k-th power nonresidues in nite elds GF(p n), where p is prime and k is a prime divisor of p n ?1. We prove under the assumption of the Extended Riemann Hypothesis (ERH), that for xed n and p ! 1, our algorithm runs in polynomial time. Unlike previous algorithms for this problem, this polynomial time bound holds even if k ...
متن کاملSome enumerative combinatorics arising from a problem on quadratic nonresidues
If A is a finite set of cardinality n ≥ 1, 2 is the set of all subsets of A, and S is a nonempty subset of 2, we say that S has the odd-intersection property if there exists a subset N of A such that the cardinality of N ∩S is odd for each S ∈ S. Let OIP (n) denote the set of all subsets of 2 with the odd-intersection property. A nonempty set S of nonempty subsets of A is an obstruction (to the...
متن کامل